An extremal problem for paths in bipartite graphs
نویسندگان
چکیده
A. Gyartas HUNGARIAN ACADEMY OF SCIENCES
منابع مشابه
Det-extremal cubic bipartite graphs
Let G be a connected k–regular bipartite graph with bipartition V (G) = X ∪Y and adjacency matrix A. We say G is det–extremal if per(A) = |det(A)|. Det–extremal k–regular bipartite graphs exist only for k = 2 or 3. McCuaig has characterized the det–extremal 3–connected cubic bipartite graphs. We extend McCuaig’s result by determining the structure of det–extremal cubic bipartite graphs of conne...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملExtremal K(s, t)-free bipartite graphs
Throughout this paper only undirected simple graphs (without loops or multiple edges) are considered. Unless stated otherwise, we follow the book by Bollobás [2] for undefined terminology and definitions. LetG = G(m,n) = G(X,Y ) denote a bipartite graph with vertex classesX and Y such that |X| = m and |Y | = n. A complete bipartite subgraph with s vertices in the class X and t vertices in the c...
متن کاملOn extremal k-outconnected graphs
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n ≥ 3k− 2 then m ≤ k(n− k), and for n ≥ 3k− 1 an equality is possible if, and only if, G is the complete bipartite graph Kk,n−k. Cai proved that if n ≤ 3k − 2 then m ≤ b(n + k)2/8c, and listed the cases when this bound is tight. In this paper we prove a more general theorem, which implies similar results for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 8 شماره
صفحات -
تاریخ انتشار 1984